Coordination sequences for root lattices and related graphs
نویسندگان
چکیده
The coordination sequence sΛ(k) of a graph Λ counts the number of its vertices which have distance k from a given vertex, where the distance between two vertices is defined as the minimal number of bonds in any path connecting them. For a large class of graphs, including in particular the classical root lattices, we present the coordination sequences and their generating functions, summarizing and extending recent results of Conway and Sloane [1].
منابع مشابه
Riemann-Roch for Sub-Lattices of the Root Lattice An
— Recently, Baker and Norine (Advances in Mathematics, 215(2): 766-788, 2007) found new analogies between graphs and Riemann surfaces by developing a Riemann-Roch machinery on a finite graph G. In this paper, we develop a general Riemann-Roch Theory for sub-lattices of the root lattice An by following the work of Baker and Norine, and establish connections between the Riemann-Roch theory and th...
متن کاملTwo-graphs on 36 Points from the Even Unimodular Lattices E 8 E 8 and D + 16
We show in this paper a power of a construction 5], 6] of two-graphs from doubly even lattices. A doubly even lattice is an even lattice multiplied by p 2. We apply this construction to the even unimodular lattices E 8 E 8 and D + 16 multiplied by p 2. For the lattice p 2(E 8 E 8), the construction gives one family of regular two-graphs on 36 points. We think that many of two-graphs of this fam...
متن کاملFrom Neel to NPC: Colouring Small Worlds
In this note, we present results for the colouring problem on small world graphs created by rewiring square, triangular, and two kinds of cubic (with coordination numbers 5 and 6) lattices. As the rewiring parameter p tends to 1, we find the expected crossover to the behaviour of random graphs with corresponding connectivity. However, for the cubic lattices there is a region near p = 0 for whic...
متن کاملSpanning trees on graphs and lattices in d dimensions
The problem of enumerating spanning trees on graphs and lattices is considered. We obtain bounds on the number of spanning trees NST and establish inequalities relating the numbers of spanning trees of different graphs or lattices. A general formulation is presented for the enumeration of spanning trees on lattices in d 2 dimensions, and is applied to the hypercubic, body-centred cubic, face-ce...
متن کاملInvestigation of continuous-time quantum walk on root lattice An and honeycomb lattice
The continuous-time quantum walk (CTQW) on root lattice An ( known as hexagonal lattice for n = 2) and honeycomb one is investigated by using spectral distribution method. To this aim, some association schemes are constructed from abelian group Z⊗n m and two copies of finite hexagonal lattices, such that their underlying graphs tend to root lattice An and honeycomb one, as the size of the under...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997